Dimensionless, Scale Invariant, Edge Weight Metric for the Study of Complex Structural Networks
نویسندگان
چکیده
High spatial and angular resolution diffusion weighted imaging (DWI) with network analysis provides a unique framework for the study of brain structure in vivo. DWI-derived brain connectivity patterns are best characterized with graph theory using an edge weight to quantify the strength of white matter connections between gray matter nodes. Here a dimensionless, scale-invariant edge weight is introduced to measure node connectivity. This edge weight metric provides reasonable and consistent values over any size scale (e.g. rodents to humans) used to quantify the strength of connection. Firstly, simulations were used to assess the effects of tractography seed point density and random errors in the estimated fiber orientations; with sufficient signal-to-noise ratio (SNR), edge weight estimates improve as the seed density increases. Secondly to evaluate the application of the edge weight in the human brain, ten repeated measures of DWI in the same healthy human subject were analyzed. Mean edge weight values within the cingulum and corpus callosum were consistent and showed low variability. Thirdly, using excised rat brains to study the effects of spatial resolution, the weight of edges connecting major structures in the temporal lobe were used to characterize connectivity in this local network. The results indicate that with adequate resolution and SNR, connections between network nodes are characterized well by this edge weight metric. Therefore this new dimensionless, scale-invariant edge weight metric provides a robust measure of network connectivity that can be applied in any size regime.
منابع مشابه
Edge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملStudy of PKA binding sites in cAMP-signaling pathway using structural protein-protein interaction networks
Backgroud: Protein-protein interaction, plays a key role in signal transduction in signaling pathways. Different approaches are used for prediction of these interactions including experimental and computational approaches. In conventional node-edge protein-protein interaction networks, we can only see which proteins interact but ‘structural networks’ show us how these proteins inter...
متن کاملCoupled coincidence point theorems for maps under a new invariant set in ordered cone metric spaces
In this paper, we prove some coupled coincidence point theorems for mappings satisfying generalized contractive conditions under a new invariant set in ordered cone metric spaces. In fact, we obtain sufficient conditions for existence of coupled coincidence points in the setting of cone metric spaces. Some examples are provided to verify the effectiveness and applicability of our results.
متن کاملOn a Metric on Translation Invariant Spaces
In this paper we de ne a metric on the collection of all translation invarinat spaces on a locally compact abelian group and we study some properties of the metric space.
متن کاملProviding a Link Prediction Model based on Structural and Homophily Similarity in Social Networks
In recent years, with the growing number of online social networks, these networks have become one of the best markets for advertising and commerce, so studying these networks is very important. Most online social networks are growing and changing with new communications (new edges). Forecasting new edges in online social networks can give us a better understanding of the growth of these networ...
متن کامل